Formalization of Petri Nets with Individual Tokens as Basis for DPO Net Transformations

نویسندگان

  • Tony Modica
  • Karsten Gabriel
  • Kathrin Hoffmann
چکیده

Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net structure during runtime. They have been successfully used in different areas like mobile ad-hoc networks. In most of these applications the modification of net markings during runtime is an important issue. This requires the analysis of the interaction between firing and rule-based modification. For place/transition systems this analysis has been started explicitly without using the general theory of M -adhesive transformation systems, because firing cannot be expressed by rule-based transformations for P/T systems in this framework. This problem is solved in this paper using the new approach of P/T nets with individual tokens. In our main results we show that on one hand this new approach allows to express firing by transformation via suitable transition rules. On the other hand transformations of P/T nets with individual tokens can be shown to be an instance of M -adhesive transformation systems, such that several well-known results, like the local Church-Rosser theorem, can be applied. This avoids a separate conflict analysis of token firing and transformations. Moreover, we compare the behavior of P/T nets with individual tokens with that of classical P/T nets. Our new approach is also motivated and demonstrated by a network scenario modeling a distributed communication system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible Independence of Net Transformations and Token Firing in the Cospan DPO Approach

The double pushout (DPO) approach for graph transformation has been applied already to Petri nets in order to model rule based transformations of the net structure. Recently, as alternative to the classical DPO approach, the cospan DPO approach has been proposed where rules are cospans instead of spans. Although the cospan DPO approach has been shown to be equivalent to the classical DPO approa...

متن کامل

RONs Revisited: General Approach to Model Reconfigurable Object Nets based on Algebraic High-Level Nets

Reconfigurable Object Nets (RONs) have been implemented in our group to support the visual specification of controlled rule-based transformations of marked place/transition (P/T) nets. RONs are high-level nets (system nets) with two types of tokens: object nets (P/T nets) and net transformation rules. System net transitions can be of different types to fire object net transitions, move object n...

متن کامل

Performance Evaluation Using Timed Coloured Petri Nets

Coloured Petri nets are Petri nets in which attributes are associated with individual tokens. These attributes are called “colours”. The set of colours is finite. Colors can be modified during transition firings, and the same transition can perform diffcrcn t transformations for tokens of different colours. Colours can thus distinguish tokens, and this allows to “fold” similar subnets of a net ...

متن کامل

The Formalization of Decision-Free Petri Net

In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it on...

متن کامل

Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors

Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of M -functors F : (C1,M1) → (C2,M2) between M -adhesive categories. This new approach allows to translate transformations in (C1,M1) into corresponding transformations in (C2,M2) and, vice versa, to create transformations in (C1,M1) from those in (C2,M2). This is help...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ECEASST

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2010